Soft Bit Decoding of Low Density Parity Check Codes

نویسندگان

  • Sheryl L. Howard
  • Vincent C. Gaudet
  • Christian Schlegel
چکیده

A novel soft-bit-domain decoding algorithm for low-density parity-check codes is derived as an alternative to belief propagation and min-sum algorithms. A simple approximation analogous to the min-sum approximation is also presented. Simulation results demonstrating the functionality of the algorithm are given both for floating and fixed point representations.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

Hard Decision and Soft Decision Decoding Algorithms for Ldpc and Qc-ldpc Codes

In this paper Hard Decision and Soft Decision decoding techniques for Quasi-Cyclic-Low Density Parity Check (QC-LDPC) code and Low Density Parity Check (LDPC) code is introduced. QC-LDPC code is proposed to reduce the complexity of the Low Density Parity Check code while obtaining the similar performance. The decoding processes of these codes are easy to simplify and implement. The algorithms u...

متن کامل

Error Performance of Decoding of LDPC over AWGN Channel

The design of future communication systems with high throughput demands will become a critical task, especially when sophisticated channel coding schemes have to be applied. Low-Density Parity-Check(LDPC) codes are among the most powerful forward error correcting codes, since they enable to get as close as a fraction of a dB from the Shannon limit. A simplified decoding algorithms for decoding ...

متن کامل

Self Reliability based Weighted Bit-Flipping Decoding for Low-density Parity-check Codes

Low Density Parity Check (LDPC) codes can be decoded in various ways, namely the Bit-Flipping (BF) algorithm, the Weighted BF algorithm (WBF), the Belief Propagation (BP) algorithm and so on. These algorithms provide a wide range of tradeoffs among decoding complexity, decoding speed, and error rate performance. In this paper, a novel self-reliability-based weighted bit-flipping decoding scheme...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004